home *** CD-ROM | disk | FTP | other *** search
- Path: news.inc.net!news
- From: Will Flor <willf@rrgroup.com>
- Newsgroups: comp.lang.c
- Subject: Re: B-Tree example...
- Date: 31 Mar 1996 22:01:31 GMT
- Organization: R R Systems Group Inc.
- Message-ID: <4jmvbr$hul@news.inc.net>
- References: <14546@828046609> <4jgo7h$n7i@darkstar.UCSC.EDU> <4jhadrINNsim@mayne.ugrad.cs.ubc.ca> <828221679snz@genesis.demon.co.uk> <4jmgan$4ui@sunburst.ccs.yorku.ca>
- NNTP-Posting-Host: 204.95.173.139
- Mime-Version: 1.0
- Content-Type: text/plain; charset=us-ascii
- Content-Transfer-Encoding: 7bit
- X-Mailer: Mozilla 1.2N (Windows; I; 32bit)
-
- "Shahed A. Quazi" <shahed@yucc.yorku.ca> wrote:
- >Hi:
- >
- >I guess I'm asking for too much, but just wondering if someone happen to
- >have a source code for a B-Tree program where a user can find, insert and
- >delete keys from a B-Tree using the following methods:
- >
- >a) Redistribution with the right sibling only.
- >b) Redistribution with both siblings.
- >c) Try the right sibling first, if not, try left sibling.
- >
- >Actually, I'm writing a simple interactive database program where I need
- >to use B-Tree extensively and I think some good examples would greatly
- >help to widen my thoughts.
- >
- >Any response would be highly appreciated.
- >
-
- Have you looked in Knuth and _Algorithms in C_?
-
- Perhaps your needs are too specialized to be matched by something in
- one of these books, but they would be my starting points; you didn't
- mention if you had looked there.
-
- -Will Flor willf@rrgroup.com
-
-
-